Separating $\oplus L$ from $L, NL,$ co-$NL$, and $AL = P$ for oblivious Turing machines of linear access
نویسندگان
چکیده
منابع مشابه
The Tree Evaluation Problem: Towards Separating P from NL
As of today, we do not know if even one among the above sequence of containments is strict. In fact, it is open if AC(6)=PH ! In this lecture by Steve we learn about an attempt aimed at separating P from NL using a specific problem called the Tree Evaluation Problem. Most of the contents of the talk are derived from the work “Pebbles and Branching Programs for tree evaluation” [1] by Steve Cook...
متن کاملNP is not AL and P is not NC is not NL is not L
1. Overview This paper talk about that NP is not AL and P, P is not NC, NC is not NL, and NL is not L. The point about this paper is the depend relation of the problem that need other problem's result to compute it. I show the structure of depend relation that could divide each complexity classes. 2. The condition to emulate the TM by using UTM We will begin by considering the important nature ...
متن کاملLecture 9 : NL = co - NL & Boolean Circuits
Proof Since PATH is co-NL-complete, it suffices to prove that PATH ∈ NL. We’ll use the the read-once certificate definition of NSPACE(·). Let Ci def = {vertices reachable from s with ≤ i steps}. Clearly, C0 = {s}. To prove “vertex x ∈ V can be reached in at most i steps starting from s” (x ∈ Ci), it’s easy by providing the path as a certificate: s, v1, · · · , v`, x where ` < i. The verifier si...
متن کاملSeparating the complexity classes NL and NP
There is no first order reduction from 3COLOR to REACH. Therefore NL 6= NP.
متن کاملIsolation Lemma for Directed Reachability and NL vs. L
In this work we study the problem of efficiently isolating witnesses for the complexity classes NL and LogCFL, which are two well-studied complexity classes contained in P. We prove that if there is a L/poly randomized procedure with success probability at least 2/3 for isolating an s-t path in a given directed graph with a source sink pair (s, t) then NL is contained in L/poly. By isolating a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 1992
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/1992260605071